Connectionist computations of intuitionistic reasoning
نویسندگان
چکیده
منابع مشابه
A Connectionist Framework for Reasoning : Reasoning
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries and in general, takes time that is linear with the number of rules in the query. The abduction algorithm produces an explanation in few steps and the best explanation in time linear with the size of the assumption set...
متن کاملSpatial Reasoning and Connectionist Inference
The system presented in this paper is based on ideas taken from Automated Reasoning and Connectionism. The connectionist inference system Chcl is applied to solve the question whether a given sentence correctly describes the spatial relations of objects shown in a visual scene. The sentence is posed in relational form to a set of rules deening spatial relations among objects and a set of facts ...
متن کاملHypothetical Reasoning with Intuitionistic Logic
This paper addresses a limitation of most deductive database systems: They cannot reason hypothetically. Although they reason eeectively about the world as it is, they are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, this paper presents a logic-programming language in which a user can cr...
متن کاملConnectionist Models of Rule-Based Reasoning
We investigate connectionist models of rule-based reasoning, and show that while such models usually carry out reasoning in exactly the same way as symbolic systems, they have more to ooer in terms of commonsense reasoning. A connection-ist architecture for commonsense reasoning, CON-SYDERR, is proposed to account for common-sense reasoning patterns and to remedy the brit-tleness problem in tra...
متن کاملA Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries and in general, takes time that is linear with the number of rules in the query. The abduction algorithm produces an explanation in few steps and the best explanation in time linear with the size of the assumption set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.043